Search results for "STATISTICS & PROBABILITY"
showing 10 items of 436 documents
Three-page encoding and complexity theory for spatial graphs
2004
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
Rejection odds and rejection ratios: A proposal for statistical practice in testing hypotheses
2016
Much of science is (rightly or wrongly) driven by hypothesis testing. Even in situations where the hypothesis testing paradigm is correct, the common practice of basing inferences solely on p-values has been under intense criticism for over 50 years. We propose, as an alternative, the use of the odds of a correct rejection of the null hypothesis to incorrect rejection. Both pre-experimental versions (involving the power and Type I error) and post-experimental versions (depending on the actual data) are considered. Implementations are provided that range from depending only on the p-value to consideration of full Bayesian analysis. A surprise is that all implementations -- even the full Baye…
Choosing Optimal Seed Nodes in Competitive Contagion.
2019
International audience; In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser whi…
Self-stabilizing Balls & Bins in Batches
2016
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. [Azar et al.; JoC'99] showed that d=2 yields an exponential improvement compared to d=1. [Berenbrink et al.; JoC'06] extended this to m ⇒ n, showing that the maximal load difference is independent of m for d=2 (in contrast…
Integrating retirement and permanent disability in NDC pension schemes
2015
ABSTRACTIn this article, we develop a theoretical basis for integrating retirement and permanent disability using a generic nonfinancial defined contribution framework. The methodology we use relies on a multistate overlapping generations model that includes the so-called survivor dividend. Currently, this feature can only be found in the Swedish defined contribution (DC) scheme. The results achieved in the numerical example we present endorse the fact that the model works well. Special attention is given to the assumptions made about mortality rates for disabled people and disability incidence rates, which largely determine the contribution rate assigned to disability. The model could be o…
Robustness of the Gaussian concentration inequality and the Brunn–Minkowski inequality
2016
We provide a sharp quantitative version of the Gaussian concentration inequality: for every $r>0$, the difference between the measure of the $r$-enlargement of a given set and the $r$-enlargement of a half-space controls the square of the measure of the symmetric difference between the set and a suitable half-space. We also prove a similar estimate in the Euclidean setting for the enlargement with a general convex set. This is equivalent to the stability of the Brunn-Minkowski inequality for the Minkowski sum between a convex set and a generic one.
Discussion of "modern statistics of spatial point processes"
2007
The paper ‘Modern statistics for spatial point processes' by Jesper Møller and Rasmus P. Waagepetersen is based on a special invited lecture given by the authors at the 21st Nordic Conference on Mathematical Statistics, held at Rebild, Denmark, in June 2006. At the conference, Antti Penttinen and Eva B. Vedel Jensen were invited to discuss the paper. We here present the comments from the two invited discussants and from a number of other scholars, as well as the authors' responses to these comments. Below Figure 1, Figure 2, etc., refer to figures in the paper under discussion, while Figure A, Figure B, etc., refer to figures in the current discussion. All numbered sections and formulas ref…
Determinants of spatial intensity of stop locations on cruise passengers tracking data
2021
This paper aims at analyzing the spatial intensity in the distribution of stop locations of cruise passengers during their visit at the destination through a stochastic point process modelling approach on a linear network. Data collected through the integration of GPS tracking technology and questionnaire-based survey on cruise passengers visiting the city of Palermo are used, to identify the main determinants which characterize their stop locations pattern. The spatial intensity of stop locations is estimated through a Gibbs point process model, taking into account for both individual-related variables, contextual-level information, and for spatial interaction among stop points. The Berman…
Kernel-Based Inference of Functions Over Graphs
2018
Abstract The study of networks has witnessed an explosive growth over the past decades with several ground-breaking methods introduced. A particularly interesting—and prevalent in several fields of study—problem is that of inferring a function defined over the nodes of a network. This work presents a versatile kernel-based framework for tackling this inference problem that naturally subsumes and generalizes the reconstruction approaches put forth recently for the signal processing by the community studying graphs. Both the static and the dynamic settings are considered along with effective modeling approaches for addressing real-world problems. The analytical discussion herein is complement…
Conical upper density theorems and porosity of measures
2008
Abstract We study how measures with finite lower density are distributed around ( n − m ) -planes in small balls in R n . We also discuss relations between conical upper density theorems and porosity. Our results may be applied to a large collection of Hausdorff and packing type measures.